### Look at other dictionaries:

**Acyclic models theorem**— In Algebraic Topology, the Method of Acyclic Models, or Acyclic Models Theorem describes a process by which two homology theories can be shown to be isomorphic. The theorem was developed by topologists Samuel Eilenberg and Saunders MacLane. They… … Wikipedia**Decomposition method (constraint satisfaction)**— In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia**isoprenoid**— /uy seuh pree noyd/, adj. Chem. pertaining to, derived from, or similar to isoprene. [1955 60; ISOPRENE + OID] * * * or terpene Class of organic compounds made up of two or more structural units derived from isoprene. Isoprene is a five carbon… … Universalium**Olefin metathesis**— or transalkylidenation is an organic reaction that entails redistribution of alkylene fragments by the scission of carbon carbon double bonds in olefins (alkenes).[1] Its advantages include the creation of fewer sideproducts and hazardous wastes … Wikipedia**Dijkstra–Scholten algorithm**— The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia**organosulfur compound**— ▪ chemical compound Introduction also spelled organosulphur compound , also called organic sulfur compound a subclass of organic substances that contain sulfur and that are known for their varied occurrence and unusual properties. They are… … Universalium**Bayesian network**— A Bayesian network, Bayes network, belief network or directed acyclic graphical model is a probabilistic graphical model that represents a set of random variables and their conditional dependencies via a directed acyclic graph (DAG). For example … Wikipedia**Dijkstra-Scholten algorithm**— The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… … Wikipedia**Persistent carbene**— A stable carbene: isolated 1,3 dimesitylimidazol 2 ylidene in a Schlenk flask (stir bar also present). A persistent carbene (also known as stable carbene or Arduengo carbene) is a type of carbene demonstrating particular stability. The best known … Wikipedia**Arrow's impossibility theorem**— In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… … Wikipedia**Alkane**— Not to be confused with Alkene or Alkyne. Chemical structure of methane, the simplest alkane Alkanes (also known as paraffins or saturated hydrocarbons) are chemical compounds that consist only of hydrogen and carbon atoms and are bonded… … Wikipedia